Diagonalization and the recursion theorem.
نویسندگان
چکیده
منابع مشابه
Remarks on Recursion vs. Diagonalization
Results are presented which show precise ways in which recursion rests on very simple computational bases which do not support diagonalization. A method based on recursion and making no use of diagonalization is given for proving lower bounds on computational complexity. Thus the intractability of computational problems such as Presburger arithmetic does not depend on diagonalization. This rese...
متن کاملThe diagonalization method in quantum recursion theory
As quantum parallelism allows the effective co-representation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to bemodified.Quantumdiagonalization involves unitary operatorswhose eigenvalues are different from one.
متن کاملThe Recursion Theorem (final)
Kleene’s Recursion Theorem, though provable in only a few lines, is fundamental to computability theory and allows strong self-reference in proofs. It is a fixed-point theorem in the sense that it asserts for any total computable function f , there is a number n such that n and f(n) index (or code) the same partial computable function (though we need not have f(n) = n). In this paper we will pr...
متن کاملKolmogorov Complexity and the Recursion Theorem
We introduce the concepts of complex and autocomplex sets, where a set A is complex if there is a recursive, nondecreasing and unbounded lower bound on the Kolmogorov complexity of the prefixes (of the characteristic sequence) of A, and autocomplex is defined likewise with recursive replaced by A-recursive. We observe that exactly the autocomplex sets allow to compute words of given Kolmogorov ...
متن کاملThe Recursion Theorem from a Different Angle
Suppose that DoesHalt( Program, Input ) is a program that does its best to determine if Program halts on Input. It has the following property: if it returns true then Program halts on Input, if it returns false then Program does not halt on input. There may be some cases when it returns nothing, but whenever it is humanly possible to make a determination it will make it. And when it does make a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1973
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093890812